A Note on Total Functions Existence Theorems and Computational Complexity
نویسندگان
چکیده
Nondeterministic multivalued functions with values that are poly nomially veri able and guaranteed to exist form an interesting complexity class between P and NP We show that this class which we call TFNP contains a host of important problems whose membership in P is currently not known These in clude besides factoring local optimization Brouwer xed points a computational version of Sperner s Lemma bimatrix equilibria in games and linear complemen tarity for P matrices
منابع مشابه
On Total Functions, Existence Theorems and Computational Complexity
Megiddo, N. and C.H. Papadimitriou, On total functions, existence theorems and computational complexity (Note), Theoretical Computer Science 81 (1991) 317-324. wondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist form an interesting complexity class between P and NP. We show that this class, which we call TFNP, contains a host of important ...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملExistence of positive solution to a class of boundary value problems of fractional differential equations
This paper is devoted to the study of establishing sufficient conditions for existence and uniqueness of positive solution to a class of non-linear problems of fractional differential equations. The boundary conditions involved Riemann-Liouville fractional order derivative and integral. Further, the non-linear function $f$ contain fractional order derivative which produce extra complexity. Than...
متن کامل$C$-class functions on common fixed point theorems for weak contraction mapping of integral type in modular spaces
In this paper, we use the concept of $C$-class functions introduced by Ansari [4] to prove the existence and uniqueness of common fixed point for self-mappings in modular spaces of integral inequality. Our results extended and generalized previous known results in this direction.
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کامل